0.07/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.10	% Command    : run_E %s %d THM
0.09/0.30	% Computer : n012.cluster.edu
0.09/0.30	% Model    : x86_64 x86_64
0.09/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory   : 8042.1875MB
0.09/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 960
0.09/0.30	% WCLimit    : 120
0.09/0.30	% DateTime   : Tue Aug  9 05:09:59 EDT 2022
0.09/0.30	% CPUTime    : 
0.14/0.40	Running higher-order on 8 cores theorem proving
0.14/0.40	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.14/0.40	# Version: 3.0pre003-ho
0.14/0.41	# partial match(1): HSSSSLSSSLMNHFN
0.14/0.41	# Preprocessing class: HSSSSLSSMLMNHFN.
0.14/0.41	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.14/0.41	# Starting ho_unfolding_6 with 600s (5) cores
0.14/0.41	# Starting ehoh_best_sine_rwall with 120s (1) cores
0.14/0.41	# Starting pre_casc_5 with 120s (1) cores
0.14/0.41	# Starting ehoh_best_sine with 120s (1) cores
0.14/0.41	# ehoh_best_sine with pid 15214 completed with status 0
0.14/0.41	# Result found by ehoh_best_sine
0.14/0.41	# partial match(1): HSSSSLSSSLMNHFN
0.14/0.41	# Preprocessing class: HSSSSLSSMLMNHFN.
0.14/0.41	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.14/0.41	# Starting ho_unfolding_6 with 600s (5) cores
0.14/0.41	# Starting ehoh_best_sine_rwall with 120s (1) cores
0.14/0.41	# Starting pre_casc_5 with 120s (1) cores
0.14/0.41	# Starting ehoh_best_sine with 120s (1) cores
0.14/0.41	# SinE strategy is gf500_gu_R04_F100_L20000
0.14/0.41	# ...ProofStateSinE()=9/26
0.14/0.41	# Search class: HGUSS-FFSF32-DHFSMFNN
0.14/0.41	# partial match(3): HGUSF-FFSF32-MHFFMFNN
0.14/0.41	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.14/0.41	# Starting new_ho_10 with 65s (1) cores
0.14/0.41	# new_ho_10 with pid 15221 completed with status 0
0.14/0.41	# Result found by new_ho_10
0.14/0.41	# partial match(1): HSSSSLSSSLMNHFN
0.14/0.41	# Preprocessing class: HSSSSLSSMLMNHFN.
0.14/0.41	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.14/0.41	# Starting ho_unfolding_6 with 600s (5) cores
0.14/0.41	# Starting ehoh_best_sine_rwall with 120s (1) cores
0.14/0.41	# Starting pre_casc_5 with 120s (1) cores
0.14/0.41	# Starting ehoh_best_sine with 120s (1) cores
0.14/0.41	# SinE strategy is gf500_gu_R04_F100_L20000
0.14/0.41	# ...ProofStateSinE()=9/26
0.14/0.41	# Search class: HGUSS-FFSF32-DHFSMFNN
0.14/0.41	# partial match(3): HGUSF-FFSF32-MHFFMFNN
0.14/0.41	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.14/0.41	# Starting new_ho_10 with 65s (1) cores
0.14/0.41	# Preprocessing time       : 0.001 s
0.14/0.41	# Presaturation interreduction done
0.14/0.41	
0.14/0.41	# Proof found!
0.14/0.41	# SZS status Theorem
0.14/0.41	# SZS output start CNFRefutation
0.14/0.41	thf(decl_22, type, in: $i > $i > $o).
0.14/0.41	thf(decl_23, type, emptyset: $i).
0.14/0.41	thf(decl_24, type, setadjoin: $i > $i > $i).
0.14/0.41	thf(decl_25, type, powerset: $i > $i).
0.14/0.41	thf(decl_26, type, setunion: $i > $i).
0.14/0.41	thf(decl_27, type, dsetconstr: $i > ($i > $o) > $i).
0.14/0.41	thf(decl_28, type, subset: $i > $i > $o).
0.14/0.41	thf(decl_29, type, kpair: $i > $i > $i).
0.14/0.41	thf(decl_30, type, cartprod: $i > $i > $i).
0.14/0.41	thf(decl_31, type, singleton: $i > $o).
0.14/0.41	thf(decl_32, type, ex1: $i > ($i > $o) > $o).
0.14/0.41	thf(decl_33, type, breln: $i > $i > $i > $o).
0.14/0.41	thf(decl_34, type, func: $i > $i > $i > $o).
0.14/0.41	thf(decl_35, type, funcSet: $i > $i > $i).
0.14/0.41	thf(decl_36, type, ap: $i > $i > $i > $i > $i).
0.14/0.41	thf(decl_37, type, app: $o).
0.14/0.41	thf(decl_38, type, infuncsetfunc: $o).
0.14/0.41	thf(decl_39, type, esk1_3: $i > $i > $i > $i).
0.14/0.41	thf(decl_40, type, esk2_4: $i > $i > $i > $i > $i).
0.14/0.41	thf(decl_41, type, esk3_0: $i).
0.14/0.41	thf(decl_42, type, esk4_0: $i).
0.14/0.41	thf(decl_43, type, esk5_0: $i).
0.14/0.41	thf(decl_44, type, esk6_0: $i).
0.14/0.41	thf(ex1, axiom, ((ex1)=(^[X1:$i, X3:$i > $o]:((singleton @ (dsetconstr @ X1 @ (^[X2:$i]:((X3 @ X2)))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ex1)).
0.14/0.41	thf(singleton, axiom, ((singleton)=(^[X1:$i]:(?[X2:$i]:(((in @ X2 @ X1)&((X1)=(setadjoin @ X2 @ emptyset))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', singleton)).
0.14/0.41	thf(func, axiom, ((func)=(^[X1:$i, X4:$i, X6:$i]:(((breln @ X1 @ X4 @ X6)&![X2:$i]:(((in @ X2 @ X1)=>(ex1 @ X4 @ (^[X7:$i]:((in @ (kpair @ X2 @ X7) @ X6)))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', func)).
0.14/0.41	thf(breln, axiom, ((breln)=(^[X1:$i, X4:$i, X5:$i]:((subset @ X5 @ (cartprod @ X1 @ X4))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln)).
0.14/0.41	thf(app, axiom, ((app)<=>![X1:$i, X4:$i, X8:$i]:(((func @ X1 @ X4 @ X8)=>![X2:$i]:(((in @ X2 @ X1)=>(in @ (ap @ X1 @ X4 @ X8 @ X2) @ X4)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', app)).
0.14/0.41	thf(infuncsetfunc, axiom, ((infuncsetfunc)<=>![X1:$i, X4:$i, X8:$i]:(((in @ X8 @ (funcSet @ X1 @ X4))=>(func @ X1 @ X4 @ X8)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', infuncsetfunc)).
0.14/0.41	thf(ap2p, conjecture, ((![X1:$i, X4:$i, X8:$i]:((![X2:$i]:(((in @ (ap @ X1 @ X4 @ X8 @ X2) @ X4)<=(in @ X2 @ X1)))<=(in @ X8 @ (funcSet @ X1 @ X4))))<=(infuncsetfunc))<=(app)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ap2p)).
0.14/0.41	thf(ap, axiom, ((ap)=(^[X1:$i, X4:$i, X8:$i, X2:$i]:(setunion @ (dsetconstr @ X4 @ (^[X7:$i]:((in @ (kpair @ X2 @ X7) @ X8))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ap)).
0.14/0.41	thf(c_0_8, plain, ((ex1)=(^[Z0:$i, Z1:$i > $o]:((?[X20:$i]:(((in @ X20 @ (dsetconstr @ Z0 @ (^[Z2:$i]:((Z1 @ Z2)))))&((dsetconstr @ Z0 @ (^[Z2:$i]:((Z1 @ Z2))))=(setadjoin @ X20 @ emptyset)))))))), inference(fof_simplification,[status(thm)],[ex1])).
0.14/0.41	thf(c_0_9, plain, ((singleton)=(^[Z0:$i]:(?[X2:$i]:(((in @ X2 @ Z0)&((Z0)=(setadjoin @ X2 @ emptyset))))))), inference(fof_simplification,[status(thm)],[singleton])).
0.14/0.41	thf(c_0_10, plain, ((func)=(^[Z0:$i, Z1:$i, Z2:$i]:((((subset @ Z2 @ (cartprod @ Z0 @ Z1)))&![X2:$i]:(((in @ X2 @ Z0)=>(?[X21:$i]:(((in @ X21 @ (dsetconstr @ Z1 @ (^[Z3:$i]:(((in @ (kpair @ X2 @ Z3) @ Z2))))))&((dsetconstr @ Z1 @ (^[Z3:$i]:(((in @ (kpair @ X2 @ Z3) @ Z2)))))=(setadjoin @ X21 @ emptyset))))))))))), inference(fof_simplification,[status(thm)],[func])).
0.14/0.41	thf(c_0_11, plain, ((breln)=(^[Z0:$i, Z1:$i, Z2:$i]:((subset @ Z2 @ (cartprod @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[breln])).
0.14/0.41	thf(c_0_12, plain, ((ex1)=(^[Z0:$i, Z1:$i > $o]:((?[X20:$i]:(((in @ X20 @ (dsetconstr @ Z0 @ (^[Z2:$i]:((Z1 @ Z2)))))&((dsetconstr @ Z0 @ (^[Z2:$i]:((Z1 @ Z2))))=(setadjoin @ X20 @ emptyset)))))))), inference(apply_def,[status(thm)],[c_0_8, c_0_9])).
0.14/0.41	thf(c_0_13, plain, ((func)=(^[Z0:$i, Z1:$i, Z2:$i]:((((subset @ Z2 @ (cartprod @ Z0 @ Z1)))&![X2:$i]:(((in @ X2 @ Z0)=>(?[X21:$i]:(((in @ X21 @ (dsetconstr @ Z1 @ (^[Z3:$i]:(((in @ (kpair @ X2 @ Z3) @ Z2))))))&((dsetconstr @ Z1 @ (^[Z3:$i]:(((in @ (kpair @ X2 @ Z3) @ Z2)))))=(setadjoin @ X21 @ emptyset))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10, c_0_11]), c_0_12])).
0.14/0.41	thf(c_0_14, axiom, ((app)=(![X1:$i, X4:$i, X8:$i]:((((((subset @ X8 @ (cartprod @ X1 @ X4)))&![X22:$i]:(((in @ X22 @ X1)=>(?[X23:$i]:(((in @ X23 @ (dsetconstr @ X4 @ (^[Z0:$i]:(((in @ (kpair @ X22 @ Z0) @ X8))))))&((dsetconstr @ X4 @ (^[Z0:$i]:(((in @ (kpair @ X22 @ Z0) @ X8)))))=(setadjoin @ X23 @ emptyset)))))))))=>![X2:$i]:(((in @ X2 @ X1)=>(in @ (ap @ X1 @ X4 @ X8 @ X2) @ X4))))))), inference(apply_def,[status(thm)],[app, c_0_13])).
0.14/0.41	thf(c_0_15, axiom, ((infuncsetfunc)=(![X1:$i, X4:$i, X8:$i]:(((in @ X8 @ (funcSet @ X1 @ X4))=>((((subset @ X8 @ (cartprod @ X1 @ X4)))&![X24:$i]:(((in @ X24 @ X1)=>(?[X25:$i]:(((in @ X25 @ (dsetconstr @ X4 @ (^[Z0:$i]:(((in @ (kpair @ X24 @ Z0) @ X8))))))&((dsetconstr @ X4 @ (^[Z0:$i]:(((in @ (kpair @ X24 @ Z0) @ X8)))))=(setadjoin @ X25 @ emptyset))))))))))))), inference(apply_def,[status(thm)],[infuncsetfunc, c_0_13])).
0.14/0.41	thf(c_0_16, negated_conjecture, ~((![X31:$i, X32:$i, X33:$i]:((((subset @ X33 @ (cartprod @ X31 @ X32))&![X34:$i]:(((in @ X34 @ X31)=>?[X35:$i]:(((in @ X35 @ (dsetconstr @ X32 @ (^[Z0:$i]:((in @ (kpair @ X34 @ Z0) @ X33)))))&((dsetconstr @ X32 @ (^[Z0:$i]:((in @ (kpair @ X34 @ Z0) @ X33))))=(setadjoin @ X35 @ emptyset)))))))=>![X36:$i]:(((in @ X36 @ X31)=>(in @ (ap @ X31 @ X32 @ X33 @ X36) @ X32)))))=>(![X26:$i, X27:$i, X28:$i]:(((in @ X28 @ (funcSet @ X26 @ X27))=>((subset @ X28 @ (cartprod @ X26 @ X27))&![X29:$i]:(((in @ X29 @ X26)=>?[X30:$i]:(((in @ X30 @ (dsetconstr @ X27 @ (^[Z0:$i]:((in @ (kpair @ X29 @ Z0) @ X28)))))&((dsetconstr @ X27 @ (^[Z0:$i]:((in @ (kpair @ X29 @ Z0) @ X28))))=(setadjoin @ X30 @ emptyset)))))))))=>![X1:$i, X4:$i, X8:$i]:(((in @ X8 @ (funcSet @ X1 @ X4))=>![X2:$i]:(((in @ X2 @ X1)=>(in @ (ap @ X1 @ X4 @ X8 @ X2) @ X4)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[ap2p]), c_0_14]), c_0_15])])).
0.14/0.41	thf(c_0_17, plain, ![X41:$i, X42:$i, X43:$i, X44:$i]:(((ap @ X41 @ X42 @ X43 @ X44)=(setunion @ (dsetconstr @ X42 @ (^[Z0:$i]:((in @ (kpair @ X44 @ Z0) @ X43))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[ap])])).
0.14/0.41	thf(c_0_18, negated_conjecture, ![X45:$i, X46:$i, X47:$i, X49:$i, X50:$i, X51:$i, X52:$i, X53:$i, X54:$i]:(((((in @ (esk1_3 @ X45 @ X46 @ X47) @ X45)|~(subset @ X47 @ (cartprod @ X45 @ X46))|(~(in @ X50 @ X45)|(in @ (ap @ X45 @ X46 @ X47 @ X50) @ X46)))&(~(in @ X49 @ (dsetconstr @ X46 @ (^[Z0:$i]:((in @ (kpair @ (esk1_3 @ X45 @ X46 @ X47) @ Z0) @ X47)))))|((dsetconstr @ X46 @ (^[Z0:$i]:((in @ (kpair @ (esk1_3 @ X45 @ X46 @ X47) @ Z0) @ X47))))!=(setadjoin @ X49 @ emptyset))|~(subset @ X47 @ (cartprod @ X45 @ X46))|(~(in @ X50 @ X45)|(in @ (ap @ X45 @ X46 @ X47 @ X50) @ X46))))&((((subset @ X53 @ (cartprod @ X51 @ X52))|~(in @ X53 @ (funcSet @ X51 @ X52)))&(((in @ (esk2_4 @ X51 @ X52 @ X53 @ X54) @ (dsetconstr @ X52 @ (^[Z0:$i]:((in @ (kpair @ X54 @ Z0) @ X53)))))|~(in @ X54 @ X51)|~(in @ X53 @ (funcSet @ X51 @ X52)))&(((dsetconstr @ X52 @ (^[Z0:$i]:((in @ (kpair @ X54 @ Z0) @ X53))))=(setadjoin @ (esk2_4 @ X51 @ X52 @ X53 @ X54) @ emptyset))|~(in @ X54 @ X51)|~(in @ X53 @ (funcSet @ X51 @ X52)))))&((in @ esk5_0 @ (funcSet @ esk3_0 @ esk4_0))&((in @ esk6_0 @ esk3_0)&~(in @ (ap @ esk3_0 @ esk4_0 @ esk5_0 @ esk6_0) @ esk4_0)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])])).
0.14/0.41	thf(c_0_19, plain, ![X62:$i, X63:$i, X64:$i, X65:$i]:(((ap @ X62 @ X63 @ X64 @ X65)=(setunion @ (dsetconstr @ X63 @ (^[Z0:$i]:((in @ (kpair @ X65 @ Z0) @ X64))))))), inference(variable_rename,[status(thm)],[c_0_17])).
0.14/0.41	thf(c_0_20, negated_conjecture, ![X2:$i, X5:$i, X4:$i, X1:$i]:(((in @ (esk1_3 @ X1 @ X2 @ X4) @ X1)|(in @ (ap @ X1 @ X2 @ X4 @ X5) @ X2)|~((subset @ X4 @ (cartprod @ X1 @ X2)))|~((in @ X5 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_18])).
0.14/0.41	thf(c_0_21, negated_conjecture, ![X1:$i, X2:$i, X4:$i]:(((subset @ X1 @ (cartprod @ X2 @ X4))|~((in @ X1 @ (funcSet @ X2 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_18])).
0.14/0.41	thf(c_0_22, plain, ![X1:$i, X2:$i, X5:$i, X4:$i]:(((ap @ X1 @ X2 @ X4 @ X5)=(setunion @ (dsetconstr @ X2 @ (^[Z0:$i]:((in @ (kpair @ X5 @ Z0) @ X4))))))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.14/0.41	thf(c_0_23, negated_conjecture, ![X2:$i, X5:$i, X4:$i, X1:$i]:(((in @ (ap @ X1 @ X2 @ X4 @ X5) @ X2)|(in @ (esk1_3 @ X1 @ X2 @ X4) @ X1)|~((in @ X4 @ (funcSet @ X1 @ X2)))|~((in @ X5 @ X1)))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.14/0.41	thf(c_0_24, negated_conjecture, (in @ esk5_0 @ (funcSet @ esk3_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.14/0.41	thf(c_0_25, negated_conjecture, ~((in @ (ap @ esk3_0 @ esk4_0 @ esk5_0 @ esk6_0) @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.14/0.41	thf(c_0_26, plain, ![X1:$i, X2:$i, X4:$i, X6:$i, X5:$i]:(((ap @ X1 @ X2 @ X4 @ X5)=(ap @ X6 @ X2 @ X4 @ X5))), inference(spm,[status(thm)],[c_0_22, c_0_22])).
0.14/0.41	thf(c_0_27, negated_conjecture, ![X1:$i, X2:$i, X5:$i, X6:$i, X4:$i]:(((in @ (ap @ X4 @ X2 @ X5 @ X6) @ X2)|~((in @ X1 @ (dsetconstr @ X2 @ (^[Z0:$i]:((in @ (kpair @ (esk1_3 @ X4 @ X2 @ X5) @ Z0) @ X5))))))|((dsetconstr @ X2 @ (^[Z0:$i]:((in @ (kpair @ (esk1_3 @ X4 @ X2 @ X5) @ Z0) @ X5))))!=(setadjoin @ X1 @ emptyset))|~((subset @ X5 @ (cartprod @ X4 @ X2)))|~((in @ X6 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_18])).
0.14/0.41	thf(c_0_28, negated_conjecture, ![X1:$i, X5:$i, X4:$i, X2:$i]:(((in @ (esk2_4 @ X1 @ X2 @ X4 @ X5) @ (dsetconstr @ X2 @ (^[Z0:$i]:((in @ (kpair @ X5 @ Z0) @ X4)))))|~((in @ X5 @ X1))|~((in @ X4 @ (funcSet @ X1 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_18])).
0.14/0.41	thf(c_0_29, negated_conjecture, ![X2:$i, X5:$i, X4:$i, X1:$i]:((((dsetconstr @ X1 @ (^[Z0:$i]:((in @ (kpair @ X2 @ Z0) @ X4))))=(setadjoin @ (esk2_4 @ X5 @ X1 @ X4 @ X2) @ emptyset))|~((in @ X2 @ X5))|~((in @ X4 @ (funcSet @ X5 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_18])).
0.14/0.41	thf(c_0_30, negated_conjecture, ![X1:$i]:(((in @ (ap @ esk3_0 @ esk4_0 @ esk5_0 @ X1) @ esk4_0)|(in @ (esk1_3 @ esk3_0 @ esk4_0 @ esk5_0) @ esk3_0)|~((in @ X1 @ esk3_0)))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.14/0.41	thf(c_0_31, negated_conjecture, (in @ esk6_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_18])).
0.14/0.41	thf(c_0_32, negated_conjecture, ![X1:$i]:(~((in @ (ap @ X1 @ esk4_0 @ esk5_0 @ esk6_0) @ esk4_0))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.14/0.41	thf(c_0_33, negated_conjecture, ![X4:$i, X6:$i, X5:$i, X2:$i, X1:$i]:(((in @ (ap @ X1 @ X2 @ X4 @ X5) @ X2)|~((in @ (esk1_3 @ X1 @ X2 @ X4) @ X6))|~((subset @ X4 @ (cartprod @ X1 @ X2)))|~((in @ X4 @ (funcSet @ X6 @ X2)))|~((in @ X5 @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])).
0.14/0.41	thf(c_0_34, negated_conjecture, (in @ (esk1_3 @ esk3_0 @ esk4_0 @ esk5_0) @ esk3_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32])).
0.14/0.41	thf(c_0_35, negated_conjecture, ![X1:$i]:(((in @ (ap @ esk3_0 @ esk4_0 @ esk5_0 @ X1) @ esk4_0)|~((subset @ esk5_0 @ (cartprod @ esk3_0 @ esk4_0)))|~((in @ X1 @ esk3_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_24])])).
0.14/0.41	thf(c_0_36, negated_conjecture, ~((subset @ esk5_0 @ (cartprod @ esk3_0 @ esk4_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_35]), c_0_31])])).
0.14/0.41	thf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_21]), c_0_24])]), ['proof']).
0.14/0.41	# SZS output end CNFRefutation
0.14/0.41	# Parsed axioms                        : 26
0.14/0.41	# Removed by relevancy pruning/SinE    : 17
0.14/0.41	# Initial clauses                      : 10
0.14/0.41	# Removed in clause preprocessing      : 0
0.14/0.41	# Initial clauses in saturation        : 10
0.14/0.41	# Processed clauses                    : 61
0.14/0.41	# ...of these trivial                  : 0
0.14/0.41	# ...subsumed                          : 30
0.14/0.41	# ...remaining for further processing  : 31
0.14/0.41	# Other redundant clauses eliminated   : 0
0.14/0.41	# Clauses deleted for lack of memory   : 0
0.14/0.41	# Backward-subsumed                    : 2
0.14/0.41	# Backward-rewritten                   : 1
0.14/0.41	# Generated clauses                    : 45
0.14/0.41	# ...of the previous two non-redundant : 44
0.14/0.41	# ...aggressively subsumed             : 0
0.14/0.41	# Contextual simplify-reflections      : 1
0.14/0.41	# Paramodulations                      : 33
0.14/0.41	# Factorizations                       : 0
0.14/0.41	# NegExts                              : 0
0.14/0.41	# Equation resolutions                 : 0
0.14/0.41	# Propositional unsat checks           : 0
0.14/0.41	#    Propositional check models        : 0
0.14/0.41	#    Propositional check unsatisfiable : 0
0.14/0.41	#    Propositional clauses             : 0
0.14/0.41	#    Propositional clauses after purity: 0
0.14/0.41	#    Propositional unsat core size     : 0
0.14/0.41	#    Propositional preprocessing time  : 0.000
0.14/0.41	#    Propositional encoding time       : 0.000
0.14/0.41	#    Propositional solver time         : 0.000
0.14/0.41	#    Success case prop preproc time    : 0.000
0.14/0.41	#    Success case prop encoding time   : 0.000
0.14/0.41	#    Success case prop solver time     : 0.000
0.14/0.41	# Current number of processed clauses  : 18
0.14/0.41	#    Positive orientable unit clauses  : 4
0.14/0.41	#    Positive unorientable unit clauses: 5
0.14/0.41	#    Negative unit clauses             : 2
0.14/0.41	#    Non-unit-clauses                  : 7
0.14/0.41	# Current number of unprocessed clauses: 2
0.14/0.41	# ...number of literals in the above   : 6
0.14/0.41	# Current number of archived formulas  : 0
0.14/0.41	# Current number of archived clauses   : 13
0.14/0.41	# Clause-clause subsumption calls (NU) : 14
0.14/0.41	# Rec. Clause-clause subsumption calls : 3
0.14/0.41	# Non-unit clause-clause subsumptions  : 1
0.14/0.41	# Unit Clause-clause subsumption calls : 17
0.14/0.41	# Rewrite failures with RHS unbound    : 0
0.14/0.41	# BW rewrite match attempts            : 31
0.14/0.41	# BW rewrite match successes           : 7
0.14/0.41	# Condensation attempts                : 61
0.14/0.41	# Condensation successes               : 0
0.14/0.41	# Termbank termtop insertions          : 2750
0.14/0.41	
0.14/0.41	# -------------------------------------------------
0.14/0.41	# User time                : 0.007 s
0.14/0.41	# System time              : 0.001 s
0.14/0.41	# Total time               : 0.008 s
0.14/0.41	# Maximum resident set size: 1880 pages
0.14/0.41	
0.14/0.41	# -------------------------------------------------
0.14/0.41	# User time                : 0.007 s
0.14/0.41	# System time              : 0.003 s
0.14/0.41	# Total time               : 0.011 s
0.14/0.41	# Maximum resident set size: 1732 pages
0.14/0.41	EOF